ASIdE: Using Autocorrelation-Based Size Estimation for Scheduling Bursty Workloads
نویسندگان
چکیده
منابع مشابه
Practical Size-based Scheduling for MapReduce Workloads
We present the Hadoop Fair Sojourn Protocol (HFSP) scheduler, which implements a size-based scheduling discipline for Hadoop. The benefits of size-based scheduling disciplines are well recognized in a variety of contexts (computer networks, operating systems, etc...), yet, their practical implementation for a system such as Hadoop raises a number of important challenges. With HFSP, which is ava...
متن کاملPacket Size Distribution: An Aside?
For multimedia traffic like VBR video, knowledge of the average loss probability is not sufficient to determine the impact of loss on the perceived visual quality and on the possible ways of improving it, for example by forward error correction (FEC) and error concealment. In this paper we investigate how the packet size distribution affects the packet loss process, the distribution of the numb...
متن کاملEntropy-based Scheduling Policy for Cross Aggregate Ranking Workloads
Many data exploration applications require the ability to identify the top-k results according to a scoring function. We study a class of top-k ranking problems where top-k candidates in a dataset are scored with the assistance of another set. We call this class of workloads cross aggregate ranking. Example computation problems include evaluating the Hausdorff distance between two datasets, fin...
متن کاملExperience with Bursty Workflow-driven Workloads in LEAD Science Gateway
Workloads created from typical meteorology forecast workflows in LEAD are bursty in nature. As the number of simultaneous workflows increases, the burstiness aggravates and we start to encounter a problem in file transfer failure that can cause the file transfer servers to crash. Our solution addresses the problem by smoothing bursts in file transfer workloads and control for limited resources ...
متن کاملRUMR: Robust Scheduling for Divisible Workloads
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been proposed to reduce application makespan. Our goal is to develop a practical divisible workload scheduling strategy. This requires that previous work be revisited as several usual assumptions about the computing platform d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network and Service Management
سال: 2012
ISSN: 1932-4537
DOI: 10.1109/tnsm.2012.041712.100073